Table-driven tests are a widely adopted style in Go, where multiple scenarios are encoded in a single data structure and executed in a loop. Despite its popularity, there is a limited understanding of how table-driven tests are implemented in the real world. This paper presents a pilot study of table-driven tests across five popular open-source Go projects, comprising over 8,000 total tests. Our analysis indicates that between 31.7% and 83.1% of tests in these projects are table-driven, with an overall prevalence of nearly half. From this, we identify a conventional structure for table-driven tests where scenarios are defined as structured data with inputs, outputs, and names, executed in loops containing assertions, and run as subtests for clarity and control. We also observed deviations that hinder readability and execution control, such as missing subtests and scenario names. To address these issues, we introduce an automated refactoring technique that integrates subtests into table-driven tests that lack them. Applied to over 1,100 eligible tests, our approach achieved a 69% success rate while preserving behavior in all but one case. These results highlight both the prevalence of table-driven testing in Go and the feasibility of automated improvements that make tests more maintainable, informative, and standardized.